#include <iostream>
using namespace std;

const int MAXN = 10;
int n, a[MAXN],u;

void dfs(int u, int sum) {
    if (sum == n && 1) {
        for (int i = 0; i < u; ++i) {
            if (i > 0) cout << '+';
            if(a[i] != n) cout << a[i];
        }
        cout << endl;
        return;
    }
    for (int i = u ? a[u - 1] : 1; i <= n - sum; ++i) {
        a[u] = i;
        dfs(u + 1, sum + i);
    }
}

int main() {
    cin >> n;
    dfs(0, 0);
    return 0;
}
